Hyperbox Granular Computing Based on Distance Measure

نویسندگان

  • Hongbing Liu
  • Huaping Guo
  • Chang-an Wu
چکیده

A bottle up hyperbox granular computing (HBGrC) is developed based on distance measure. Firstly, hyperbox granule is represented by the beginning point and the end point. Secondly, the distance measure between two hyperbox granules is defined by the beginning points and the end points. Thirdly, operations between two hyperbox granules are designed to the transformation between two hyperbox granule spaces with different granularities, HBGrC is developed by the join operator and the user-defined granularity threshold  on the basis of bottle up scheme. Experimental results shown that HBGrC achieved the better testing accuracies over the machine learning benchmark datasets.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

INTERVAL ANALYSIS-BASED HYPERBOX GRANULAR COMPUTING CLASSIFICATION ALGORITHMS

Representation of a granule, relation and operation between two granules are mainly researched in granular computing. Hyperbox granular computing classification algorithms (HBGrC) are proposed based on interval analysis. Firstly, a granule is represented as the hyperbox which is the Cartesian product of $N$ intervals for classification in the $N$-dimensional space. Secondly, the relation betwee...

متن کامل

Granular Computing Classification Algorithms Based on Distance Measures between Granules from the View of Set

Granular computing classification algorithms are proposed based on distance measures between two granules from the view of set. Firstly, granules are represented as the forms of hyperdiamond, hypersphere, hypercube, and hyperbox. Secondly, the distance measure between two granules is defined from the view of set, and the union operator between two granules is formed to obtain the granule set in...

متن کامل

Bottle Up Granular Computing Classification Algorithms

Shape of granule is one of the important issues in granular computing classification problems and related to the classification accuracy, the number of granule, and the join process of two granules. A bottle up granular computing classification algorithm (BUGrC) is developed in the frame work of fuzzy lattices. Firstly, the granules are represented as 4 shapes, namely hyperdiamond granule, hype...

متن کامل

A Novel Trust Computation Method Based on User Ratings to Improve the Recommendation

Today, the trust has turned into one of the most beneficial solutions to improve recommender systems, especially in the collaborative filtering method. However, trust statements suffer from a number of shortcomings, including the trust statements sparsity, users' inability to express explicit trust for other users in most of the existing applications, etc. Thus to overcome these problems, this ...

متن کامل

Classification and Clustering of Granular Data

Information granules are formed to reduce the complexity of the description of real-world systems. The improved generality of information granules is attained through sacrificing some of the numerical precision of point-data. In this study we consider a hyperbox-based clustering and classification of granular data and discuss detailed criteria for the assessment of the quality of the combined c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016